1

Uniform hypergraphs containing no grids

Year:
2013
Language:
english
File:
PDF, 311 KB
english, 2013
4

Decreasing the diameter of bounded degree graphs

Year:
2000
Language:
english
File:
PDF, 118 KB
english, 2000
5

Tripartite Ramsey numbers for paths

Year:
2007
Language:
english
File:
PDF, 137 KB
english, 2007
6

Large components in r-edge-colorings of Kn have diameter at most five

Year:
2012
Language:
english
File:
PDF, 64 KB
english, 2012
8

On the upper bound of the size of the r-cover-free families

Year:
1994
Language:
english
File:
PDF, 311 KB
english, 1994
9

On a 2-dimensional search problem

Year:
1993
Language:
english
File:
PDF, 654 KB
english, 1993
10

Large Convex Cones in Hypercubes

Year:
2005
Language:
english
File:
PDF, 91 KB
english, 2005
11

Large convex cones in hypercubes

Year:
2008
Language:
english
File:
PDF, 146 KB
english, 2008
12

Codes identifying sets of vertices in random networks

Year:
2007
Language:
english
File:
PDF, 266 KB
english, 2007
14

On the maximum size of (p,Q)-free families

Year:
2002
Language:
english
File:
PDF, 196 KB
english, 2002
15

On a search problem in multidimensional grids

Year:
1997
Language:
english
File:
PDF, 420 KB
english, 1997
17

Randomly generated intersecting hypergraphs II

Year:
2007
Language:
english
File:
PDF, 185 KB
english, 2007
18

Three-Color Ramsey Numbers For Paths

Year:
2007
Language:
english
File:
PDF, 450 KB
english, 2007
19

Three-color Ramsey numbers for paths

Year:
2008
Language:
english
File:
PDF, 325 KB
english, 2008
20

How to decrease the diameter of triangle-free graphs

Year:
1998
Language:
english
File:
PDF, 176 KB
english, 1998
21

Vertex Covers by Edge Disjoint Cliques

Year:
2001
Language:
english
File:
PDF, 330 KB
english, 2001
33

G-Intersecting Families

Year:
2001
Language:
english
File:
PDF, 248 KB
english, 2001